Theorem 6 M 3 Embeds P N into Sep N with Dilation (3/8)n

نویسندگان

  • S. Latifi
  • P. K. Srimani
  • F. T. Leighton
چکیده

Sketch of Proof: By examining the distance of the elements to be exchanged, one deduces that the prefix reversal of size (3 / 4)n creates the maximum distance between images, because the individual elements to be exchanged are then the furthest distance from each other. We measure the distance from

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Endothelium-Derived Relaxing Factor-like Substance

We determined the effects of mono-L-arginine-containing compounds on pial arterioles of anesthetized piglets. A closed cranial window was implanted, and the diameter of one pial arteriole was determined by intravital microscopy. Diameter was determined during application of artificial cerebrospinal fluid containing no drugs and during application of 10-5 10-4, 10-3, and 10-2 M L-arginine (ARG),...

متن کامل

Intravenous neutralization of vascular endothelial growth factor reduces vascular function/permeability of the ovary and prevents development of OHSS-like symptoms in rhesus monkeys

BACKGROUND Ovarian hyperstimulation syndrome (OHSS) is a disorder associated with elevated serum VEGFA following chorionic gonadotropin (hCG) exposure in controlled ovarian stimulation (COS) cycles in women. In this study, we tested the effect of intravenous VEGFA neutralization on OHSS-like symptoms and vascular function in rhesus macaques during COS cycles. METHODS Monkeys (n = 8) were trea...

متن کامل

A Short Proof of the Dilation of a Toroidal Mesh in a Path

We give a short proof that the dilation of an m n toroidal mesh in an mn-vertex path equals 2 minfm; ng, if m 6 = n and 2n ? 1, if m = n. The graph dilation problem appears in quite diierent areas of computer science like VLSI layouts, data representations and architectures of parallel computers. The problem can be mathematically formulated as labeling the vertices of a graph G by distinct vert...

متن کامل

/i POWER RESIDUES CONGRUENT TO ONE

In Theorem 2, we shall show that the only integers having property P(n), where n is an odd positive integer, are -2, -1, 1, and 2. In Theorem 3, we shall determine the integers which have property P(n) , where n is an even positive integer. In particular, we shall show that: m has property P(4) iff m divides 240 = 2̂ 3 -5 m has property P(6) iff m divides 504 = 23 * 7 m has property P(8) iff m d...

متن کامل

Path-kipas Ramsey numbers

For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997